Optimal Recovery Schemes in Distributed COMPUTING

Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers fail this must be redistributed. The redistribution is determined by the recovery scheme. The recovery scheme should keep the load as evenly distributed as possible even when the most unfavorable combinations of computers break down, i.e. we want to optimize the worst-case behavior. In this paper we compared all schemes (Modulo ruler, Golomb ruler, Greedy Sequence, Sloane Sequence, Log Sequence) with worst-case behavior. Finally we conclude our scheme (Sloane schemes) performs better than all the other schemes.